On the complexity of a family based on irreducible polynomials
نویسنده
چکیده
Ahlswede, Khachatrian, Mauduit and Sárközy [1] introduced the f -complexity measure (“f ” for family) in order to study pseudorandom properties of large families of binary sequences. So far several families have been studied by this measure. In the present paper I considerably improve on my earlier result in [7], where the f -complexity measure of a family based on the Legendre symbol and polynomials over Fp is studied. This paper also extends the earlier results to a family restricted on irreducible polynomials.
منابع مشابه
On the Complexity of Integer Factorization
This note presents a deterministic integer factorization algorithm based on a system of polynomials equations. This technique exploits a new idea in the construction of irreducible polynomials with parametized roots, and recent advances in polynomial lattices reduction methods. The main result establishes a new deterministic time complexity bench mark. 1 Introduction This note presents a determ...
متن کاملSymmetry classes of polynomials associated with the dihedral group
In this paper, we obtain the dimensions of symmetry classes of polynomials associated with the irreducible characters of the dihedral group as a subgroup of the full symmetric group. Then we discuss the existence of o-basis of these classes.
متن کاملTrajectory Planning Using High Order Polynomials under Acceleration Constraint
The trajectory planning, which is known as a movement from starting to end point by satisfying the constraints along the path is an essential part of robot motion planning. A common way to create trajectories is to deal with polynomials which have independent coefficients. This paper presents a trajectory formulation as well as a procedure to arrange the suitable trajectories for applications. ...
متن کاملSystematic Design of Original and Modified Mastrovito Multipliers for General Irreducible Polynomials
ÐThis paper considers the design of bit-parallel dedicated finite field multipliers using standard basis. An explicit algorithm is proposed for efficient construction of Mastrovito product matrix, based on which we present a systematic design of Mastrovito multiplier applicable to GF 2m generated by an arbitrary irreducible polynomial. This design effectively exploits the spatial correlation ...
متن کاملAn improved and efficient stenographic scheme based on matrix embedding using BCH syndrome coding.
This paper presents a new stenographic scheme based on matrix embedding using BCH syndrome coding. The proposed method embeds massage into cover by changing some coefficients of cover. In this paper defining a number :::as char:::acteristic of the syndrome, which is invariant with respect to the cyclic shift, we propose a new embedding algorithm base on BCH syndrome coding, without finding ro...
متن کامل